A Random NP-complete problem for inversion of 2D cellular automata
نویسندگان
چکیده
منابع مشابه
Inversion of 2d Cellular Automata: Some Complexity Results Inversion of 2d Cellular Automata: Some Complexity Results
In this paper, we prove the co-NP-completeness of the following decision problem: \given a 2-dimensional cellular automaton A, is A injective when restricted to nite conngurations not greater than its length?" In order to prove this result, we introduce two decision problems concerning respectively Turing Machines and tilings that we prove NP-complete. We then present a transformation of proble...
متن کاملNP-Complete Problems in Cellular Automata
An example of a cellular automat on (CA) is given in which the following problems are NP -complete: (i) determining if a given subconfigurati cn s can be gener ated af ter [s] t ime steps, (ii) determining if a given eubccnfigurat ion 8 will rec ur afte r lsi t ime steps, (iii) determining if a given te mporal sequence of state s 8 can be generated in lsi time steps. It is also found that the C...
متن کاملInversion of 2D Cellular Automata: Some Complexity Results
Durand, B. Inversion of 2D cellular automata: some complexity results, Theoretical Computer Science 134 (1994) 387401. In this paper, we prove the co-NP-completeness of the following decision problem: “Given a twodimensional cellular automaton & (even with Von Neumann neighborhood), is & injective when restricted to finite configurations not greater than its length?” In order to prove this resu...
متن کاملDesign of low power random number generators for quantum-dot cellular automata
Quantum-dot cellular automata (QCA) are a promising nanotechnology to implement digital circuits at the nanoscale. Devices based on QCA have the advantages of faster speed, lower power consumption, and greatly reduced sizes. In this paper, we are presented the circuits, which generate random numbers in QCA. Random numbers have many uses in science, art, statistics, cryptography, gaming, gambli...
متن کاملDesign of low power random number generators for quantum-dot cellular automata
Quantum-dot cellular automata (QCA) are a promising nanotechnology to implement digital circuits at the nanoscale. Devices based on QCA have the advantages of faster speed, lower power consumption, and greatly reduced sizes. In this paper, we are presented the circuits, which generate random numbers in QCA. Random numbers have many uses in science, art, statistics, cryptography, gaming, gambli...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1995
ISSN: 0304-3975
DOI: 10.1016/0304-3975(94)00293-r